Effective categoricity of Abelian p-groups
نویسندگان
چکیده
We investigate effective categoricity of computable Abelian p-groups A. We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are ∆02 categorical and relatively ∆ 0 2 categorical.
منابع مشابه
Abelian p-groups and the Halting problem
We investigate which effectively presented abelian p-groups are isomorphic relative to the halting problem. The standard approach to this and similar questions uses the notion of ∆2-categoricity (to be defined). We partially reduce the description of ∆ 0 2-categorical p-groups of Ulm type 1 to the analogous problem for equivalence structures. Using this reduction, we solve to a problem left ope...
متن کاملEffectively Categorical Abelian Groups
We study effective categoricity of computable abelian groups of the form ⊕ i∈ω H, where H is a subgroup of (Q,+). Such groups are called homogeneous completely decomposable. It is well-known that a homogeneous completely decomposable group is computably categorical if and only if its rank is finite. We study ∆n-categoricity in this class of groups, for n > 1. We introduce a new algebraic concep...
متن کاملSpace complexity of Abelian groups
We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE presentations and we show that the groups Z, Z(p∞), and the additive group of the rationals have LOGSPACE presentations over a standard universe such as the tally representation and the bin...
متن کاملComputable Ordered Abelian Groups and Fields
We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, we show that a linear order L has a ∆2 copy if and only if the corresponding ordered group (ordered field) has a computable copy. We apply these codings to study the effective categoricity of linear ordered groups and fields.
متن کاملRelative categoricity in abelian groups II
Abstract. We consider structures A consisting of an abelian group with a subgroup A distinguished by a 1-ary relation symbol P , and complete theories T of such structures. Such a theory T is (κ, λ)categorical if T hasmodelsA of cardinality λwith |A | = κ, and given any two such models A,B with A = B , there is an isomorphism from A to B which is the identity on A . We classify all complete the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 159 شماره
صفحات -
تاریخ انتشار 2009